منابع مشابه
Preferential Duplication Graphs
We consider a preferential duplication model for growing random graphs, extending previous models of duplication graphs by selecting the vertex to be duplicated with probability proportional to its degree. We show that a special case of this model can be analysed using the same stochastic approximation as for vertex-reinforced randomwalks, and show that ‘trapping’ behaviour can occur, such that...
متن کاملNongrowing Preferential Attachment Random Graphs
We consider an edge rewiring process which is widely used to model the dynamics of scale-free weblike networks. This process uses preferential attachment and operates on sparse multigraphs with n vertices and m edges. We prove that its mixing time is optimal and develop a framework which simplifies the calculation of graph properties in the steady state. The applicability of this framework is d...
متن کاملPreferential Duplication of Conserved Proteins in Eukaryotic Genomes
A central goal in genome biology is to understand the origin and maintenance of genic diversity. Over evolutionary time, each gene's contribution to the genic content of an organism depends not only on its probability of long-term survival, but also on its propensity to generate duplicates that are themselves capable of long-term survival. In this study we investigate which types of genes are l...
متن کاملPreferential Attachment in Graphs with Affinities
Here, we give a full proof of Theorem 1. Recall that an equivalent construction of the PAGA graphs is obtained by collapsing the graph G 1 to G t m leading to t super nodes. Accordingly, based on G t m, we can directly generate G m by (temporarily) adding m more nodes, each linking with a single edge, and then collapsing these m nodes to the (t+ 1)th super node. Let dt,i(v) denote the degree of...
متن کاملAsynchronous Rumor Spreading in Preferential Attachment Graphs
We show that the asynchronous push-pull protocol spreads rumors in preferential attachment graphs (as defined by Barabási and Albert) in time O( √ logn) to all but a lower order fraction of the nodes with high probability. This is significantly faster than what synchronized protocols can achieve; an obvious lower bound for these is the average distance, which is known to be Θ(logn/ log log n).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Probability
سال: 2010
ISSN: 0021-9002,1475-6072
DOI: 10.1239/jap/1276784910